Conflict-Based Selection of Branching Rules
نویسندگان
چکیده
We propose an adaptive framework for branching rule selection that is based on a set of branching rules. Each branching rule is attached a preference value that is dynamically adapted with respect to conflict analysis. Thus, our approach brings together two essential features of modern SAT algorithms which were traditionally independent from each other. Experimental results show the feasibility of our approach.
منابع مشابه
Conflict-based Selection of Branching Rules in SAT-Algorithms
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The application of SAT solvers in VLSI CAD has become of major interest. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide the search, a branching rule is applied for selecting and assigning unassigned variable...
متن کاملImproving Propositional Satisfiability Algorithms by Dynamic Selection of Branching Rules
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide search, a branching rule is applied for selecting still unassigned variables and computing an assignment to this variable. Additionally, conflict analysis metho...
متن کاملInformation-based branching schemes for binary linear mixed integer problems
Branching variable selection can greatly affect the effectiveness and efficiency of a branchand-bound algorithm. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We propose an approach which is empowered by exploiting the information contained in a family of fathomed subproblems, collected beforehand from ...
متن کاملHybrid Branching
State-of-the-art solvers for Constraint Satisfaction Problems (CSP), Mixed Integer Programs (MIP), and satisfiability problems (SAT) are usually based on a branch-and-bound algorithm. The question how to split a problem into subproblems (branching) is in the core of any branch-and-bound algorithm. Branching on individual variables is very common in CSP, MIP, and SAT. The rules, however, which v...
متن کاملImproving Strong Branching by Propagation
Strong branching is an important component of most variable selection rules in branchand-bound based mixed-integer linear programming solvers. It predicts the dual bounds of potential child nodes by solving auxiliary LPs and thereby helps to keep the branchand-bound tree small. In this paper, we describe how these dual bound predictions can be improved by including domain propagation into stron...
متن کامل